منابع مشابه
Trivial Reals
Solovay showed that there are noncomputable reals α such that H(α ↾ n) 6 H(1) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the connection between algorithmic complexity and effective randomness. We give a new, easier construction of an H-trivial real. We also analyze various computability-theoretic properties of the H-trivial reals, showing f...
متن کاملSchnorr trivial reals: a construction
A real is Martin-Löf (Schnorr) random if it does not belong to any effectively presented null Σ 0 1 (recursive) class of reals. Although these randomness notions are very closely related, the set of Turing degrees containing reals that are K-trivial has very different properties from the set of Turing degrees that are Schnorr trivial. Nies proved in [12] that all K-trivial reals are low. In thi...
متن کاملHow Trivial Is Trivial
This question is, I feel, in the same kind of idiot category as how long is a piece of string? interviewed recently by a journalist planning to write an article about the women (like me) who conduct 'Auntie' columns in women's magazines, I was asked what proportion of the letters I received each week could be labelled trivial. Her eyebrows shot up when I said that in my view, no human problem w...
متن کاملIs Trivial Dynamics That Trivial?
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Mathematical Association of America is collaborating with ...
متن کاملApproximating Reals
Abstract. In this note we formulate some questions and make first steps in the study of approximations of reals by rationals of the form a/b. Such approximations appear for instance in theory of Shrödinger equations. It is sad to note that the study of these approximations, which is interesting by itself, has been omitted. We hope to attract attention of specialists to this natural subject of n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80377-3